Existential type systems between Church and Curry style (type-free style)
نویسندگان
چکیده
منابع مشابه
Existential type systems between Church and Curry style (type-free style)
We study type checking, typability, and type inference problems for type-free style and Curry style second-order existential systems where the type-free style differs from the Curry style in that the terms of the former contain information on where the existential quantifier elimination and introduction take place but omit the information on which types are involved. We show that all the proble...
متن کاملRelating Church-Style and Curry-Style Subtyping
Type theories with higher-order subtyping or singleton types are examples of systems where computation rules for variables are affected by type information in the context. A complication for these systems is that bounds declared in the context do not interact well with the logical relation proof of completeness or termination. This paper proposes a natural modification to the type syntax for Fω...
متن کاملDecidable structures between Church-style and Curry-style
It is well-known that the type-checking and type-inference problems are undecidable for second order λ-calculus in Curry-style, although those for Church-style are decidable. What causes the differences in decidability and undecidability on the problems? We examine crucial conditions on terms for the (un)decidability property from the viewpoint of partially typed terms, and what kinds of type a...
متن کاملCurry-style type Isomorphisms and Game Semantics
Curry-style system F, i.e. system F with no explicit types in terms, can be seen as a core presentation of polymorphism from the point of view of programming languages. This paper gives a characterisation of type isomorphisms for this language, by using a game model whose intuition comes both from the syntax and fromthe game semantics universe. Themodel is composed of: an untyped part to interp...
متن کاملOn the relation between Church - style typing and Curry - style typing : Extended Abstract ∗
There are two versions of type assignment in λ-calculus: Church-style, in which the type of each variable is fixed, and Curry-style (also called “domain free”), in which it is not. As an example, in Church-style typing, λx : A . x is the identity function on type A, and it has type A → A but not B → B for a type B different from A. In Curry-style typing, λx.x is a general identity function with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.05.019